________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:15:45
Input Data from:  dataset108.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :1

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,139
Average f[i]   :3550
Average g[i,j] :2000
Total demand   :5030
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 23
> Selected Move:	1880	1	-1	3	5500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  0  0    >new incumb.: 1880


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 34
> Selected Move:	2240	1	-1	4	10000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  0    >new incumb.: 2240


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 37
> Selected Move:	2590	1	-1	9	14000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  0  1    >new incumb.: 2590


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 35
> Selected Move:	2680	1	-1	6	20000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1    >new incumb.: 2680


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 23
> Selected Move:	2630	3	6	7	18500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 26
> Selected Move:	2630	3	3	5	18000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 30
> Selected Move:	2640	3	1	6	19700


> New Y[]: 
	
	 2  0  4  0  1  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 21
> Selected Move:	2550	3	6	3	19800


> New Y[]: 
	
	 2  0  4  3  1  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 16
> Selected Move:	2550	2	5	-1	14800


> New Y[]: 
	
	 2  0  4  3  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 22
> Selected Move:	2550	4	3	4	15500


> New Y[]: 
	
	 2  0  4  1  3  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 20
> Selected Move:	2550	4	4	7	15700


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 18
> Selected Move:	2550	4	7	9	16800


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 22
> Selected Move:	2550	3	3	5	16300


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 20
> Selected Move:	2550	4	9	4	15000


> New Y[]: 
	
	 2  0  4  0  3  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 20
> Selected Move:	2550	4	4	5	14600


> New Y[]: 
	
	 2  0  4  0  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 21
> Selected Move:	2550	4	5	7	15200


> New Y[]: 
	
	 2  0  4  0  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 23
> Selected Move:	2520	3	7	1	13500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 35
> Selected Move:	2610	1	-1	6	19500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 23
> Selected Move:	2590	3	6	3	19000


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 22
> Selected Move:	2590	3	5	8	20000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 20
> Selected Move:	2520	4	1	3	16300


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 22
> Selected Move:	2530	3	8	6	16300


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 23
> Selected Move:	2530	4	3	4	17000


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 21
> Selected Move:	2530	4	4	6	15700


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 22
> Selected Move:	2558	1	-1	7	20200


> New Y[]: 
	
	 2  0  4  1  1  0  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 20
> Selected Move:	2510	3	6	5	20100


> New Y[]: 
	
	 2  0  4  1  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 17
> Selected Move:	2400	3	3	6	20600


> New Y[]: 
	
	 2  0  4  0  1  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 17
> Selected Move:	2470	2	9	-1	16600


> New Y[]: 
	
	 2  0  4  0  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 25
> Selected Move:	2470	4	5	4	17000


> New Y[]: 
	
	 2  0  4  0  3  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 25
> Selected Move:	2470	4	4	6	15700


> New Y[]: 
	
	 2  0  4  0  1  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 24
> Selected Move:	2470	4	6	7	17200


> New Y[]: 
	
	 2  0  4  0  1  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 26
> Selected Move:	2470	3	5	3	17700


> New Y[]: 
	
	 2  0  4  1  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 24
> Selected Move:	2530	3	7	9	18300


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 24
> Selected Move:	2520	3	6	8	18300


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 18
> Selected Move:	2520	4	9	4	17000


> New Y[]: 
	
	 2  0  4  1  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 18
> Selected Move:	2520	4	4	8	16500


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 26
> Selected Move:	2440	3	9	6	18500


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 21
> Selected Move:	2510	3	8	1	16000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 30
> Selected Move:	2440	3	3	5	15500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 31
> Selected Move:	2550	1	-1	7	20000


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 25
> Selected Move:	2510	3	4	9	19500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 24
> Selected Move:	2510	3	5	3	20000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 24
> Selected Move:	2430	4	1	3	16300


> New Y[]: 
	
	 2  0  4  3  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 29
> Selected Move:	2470	3	9	4	16800


> New Y[]: 
	
	 2  0  4  3  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 25
> Selected Move:	2470	4	3	4	17500


> New Y[]: 
	
	 2  0  4  1  3  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 24
> Selected Move:	2470	4	4	6	16200


> New Y[]: 
	
	 2  0  4  1  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 26
> Selected Move:	2440	3	7	8	17700


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 26
> Selected Move:	2440	4	6	3	18300


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 23
> Selected Move:	2440	4	3	4	19000


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 25
> Selected Move:	2430	3	8	5	18000


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 23
> Selected Move:	2430	4	4	3	17300


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 24
> Selected Move:	2430	4	3	5	17600


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 21
> Selected Move:	2430	4	5	6	16700


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 25
> Selected Move:	2415	1	-1	9	20700


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 20
> Selected Move:	2410	2	3	-1	15200


> New Y[]: 
	
	 2  0  4  0  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 24
> Selected Move:	2430	3	4	7	15200


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 26
> Selected Move:	2430	4	6	5	16100


> New Y[]: 
	
	 2  0  4  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 24
> Selected Move:	2430	4	5	7	16700


> New Y[]: 
	
	 2  0  4  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 25
> Selected Move:	2430	4	7	9	17800


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 26
> Selected Move:	2430	3	5	3	18300


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 22
> Selected Move:	2430	4	9	6	15700


> New Y[]: 
	
	 2  0  4  1  0  0  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 25
> Selected Move:	2430	4	6	7	17200


> New Y[]: 
	
	 2  0  4  1  0  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 25
> Selected Move:	2420	3	6	8	17200


> New Y[]: 
	
	 2  0  4  1  0  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 26
> Selected Move:	2420	4	7	3	16300


> New Y[]: 
	
	 2  0  4  3  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 26
> Selected Move:	2462	1	-1	4	20800


> New Y[]: 
	
	 2  0  4  3  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 19
> Selected Move:	2507	3	3	5	20600


> New Y[]: 
	
	 2  0  4  0  1  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 18
> Selected Move:	2530	4	5	8	20500


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 21
> Selected Move:	2435	4	8	4	21000


> New Y[]: 
	
	 2  0  4  0  3  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 21
> Selected Move:	2455	3	8	3	20500


> New Y[]: 
	
	 2  0  4  1  3  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 69 #######################


> Neighbours evaluated; 20
> Selected Move:	2445	3	3	6	21000


> New Y[]: 
	
	 2  0  4  0  3  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 70 #######################


> Neighbours evaluated; 19
> Selected Move:	2410	2	7	-1	16500


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 71 #######################


> Neighbours evaluated; 23
> Selected Move:	2410	4	4	5	16100


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 72 #######################


> Neighbours evaluated; 23
> Selected Move:	2410	4	5	9	17800


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 73 #######################


> Neighbours evaluated; 22
> Selected Move:	2400	3	6	8	17800


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 74 #######################


> Neighbours evaluated; 24
> Selected Move:	2420	3	4	7	17800


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 75 #######################


> Neighbours evaluated; 23
> Selected Move:	2420	4	9	5	16100


> New Y[]: 
	
	 2  0  4  0  0  3  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 76 #######################


> Neighbours evaluated; 24
> Selected Move:	2420	4	5	7	16700


> New Y[]: 
	
	 2  0  4  0  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 77 #######################


> Neighbours evaluated; 24
> Selected Move:	2420	4	7	8	16000


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 78 #######################


> Neighbours evaluated; 26
> Selected Move:	2420	3	5	3	16500


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 79 #######################


> Neighbours evaluated; 23
> Selected Move:	2425	1	-1	4	21000


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 80 #######################


> Neighbours evaluated; 20
> Selected Move:	2390	2	9	-1	17000


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 81 #######################


> Neighbours evaluated; 25
> Selected Move:	2390	4	8	3	16800


> New Y[]: 
	
	 2  0  4  3  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 82 #######################


> Neighbours evaluated; 25
> Selected Move:	2390	4	3	4	17500


> New Y[]: 
	
	 2  0  4  1  3  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 83 #######################


> Neighbours evaluated; 24
> Selected Move:	2420	3	4	9	18300


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 84 #######################


> Neighbours evaluated; 24
> Selected Move:	2340	3	8	5	17300


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 85 #######################


> Neighbours evaluated; 23
> Selected Move:	2340	4	9	3	15300


> New Y[]: 
	
	 2  0  4  3  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 86 #######################


> Neighbours evaluated; 22
> Selected Move:	2420	3	3	1	13500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 87 #######################


> Neighbours evaluated; 28
> Selected Move:	2420	3	5	3	14000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 88 #######################


> Neighbours evaluated; 27
> Selected Move:	2420	1	-1	5	19000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 89 #######################


> Neighbours evaluated; 23
> Selected Move:	2420	3	3	8	19500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 90 #######################


> Neighbours evaluated; 24
> Selected Move:	2520	3	7	4	19500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 91 #######################


> Neighbours evaluated; 27
> Selected Move:	2456	3	1	7	21200


> New Y[]: 
	
	 2  0  4  0  1  1  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 92 #######################


> Neighbours evaluated; 21
> Selected Move:	2472	3	8	6	21200


> New Y[]: 
	
	 2  0  4  0  1  1  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 93 #######################


> Neighbours evaluated; 20
> Selected Move:	2456	3	6	3	20700


> New Y[]: 
	
	 2  0  4  1  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 94 #######################


> Neighbours evaluated; 19
> Selected Move:	2419	3	5	6	21700


> New Y[]: 
	
	 2  0  4  1  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 95 #######################


> Neighbours evaluated; 18
> Selected Move:	2540	4	7	3	20800


> New Y[]: 
	
	 2  0  4  3  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 96 #######################


> Neighbours evaluated; 19
> Selected Move:	2445	4	3	4	21500


> New Y[]: 
	
	 2  0  4  1  3  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 97 #######################


> Neighbours evaluated; 20
> Selected Move:	2428	3	6	8	21500


> New Y[]: 
	
	 2  0  4  1  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 98 #######################


> Neighbours evaluated; 19
> Selected Move:	2420	3	4	1	20000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 99 #######################


> Neighbours evaluated; 26
> Selected Move:	2330	3	3	4	19000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 100 #######################


> Neighbours evaluated; 28
> Selected Move:	2420	3	8	6	19000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 101 #######################


> Neighbours evaluated; 27
> Selected Move:	2473	3	9	3	20500


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 102 #######################


> Neighbours evaluated; 29
> Selected Move:	2350	3	7	5	21000


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 103 #######################


> Neighbours evaluated; 27
> Selected Move:	2288	3	4	9	20500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 104 #######################


> Neighbours evaluated; 26
> Selected Move:	2370	2	5	-1	15500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 105 #######################


> Neighbours evaluated; 33
> Selected Move:	2340	3	9	7	16000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 106 #######################


> Neighbours evaluated; 33
> Selected Move:	2340	3	1	8	18500


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 107 #######################


> Neighbours evaluated; 26
> Selected Move:	2340	4	8	3	18300


> New Y[]: 
	
	 2  0  4  3  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,17

## ITERATION 108 #######################


> Neighbours evaluated; 26
> Selected Move:	2340	4	3	6	17700


> New Y[]: 
	
	 2  0  4  1  0  0  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 109 #######################


> Neighbours evaluated; 26
> Selected Move:	2340	4	6	7	19200


> New Y[]: 
	
	 2  0  4  1  0  0  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 110 #######################


> Neighbours evaluated; 26
> Selected Move:	2390	3	6	4	17700


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 111 #######################


> Neighbours evaluated; 24
> Selected Move:	2390	3	3	5	17200


> New Y[]: 
	
	 2  0  4  0  1  1  0  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 112 #######################


> Neighbours evaluated; 24
> Selected Move:	2390	4	7	4	17000


> New Y[]: 
	
	 2  0  4  0  3  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 113 #######################


> Neighbours evaluated; 23
> Selected Move:	2400	3	7	9	16500


> New Y[]: 
	
	 2  0  4  0  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 114 #######################


> Neighbours evaluated; 22
> Selected Move:	2400	4	4	5	16100


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 115 #######################


> Neighbours evaluated; 22
> Selected Move:	2400	4	5	8	16000


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 116 #######################


> Neighbours evaluated; 23
> Selected Move:	2395	1	-1	3	21500


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 117 #######################


> Neighbours evaluated; 20
> Selected Move:	2428	4	8	3	21300


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 118 #######################


> Neighbours evaluated; 21
> Selected Move:	2444	3	8	6	21300


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 119 #######################


> Neighbours evaluated; 19
> Selected Move:	2416	4	3	5	21600


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 120 #######################


> Neighbours evaluated; 19
> Selected Move:	2414	3	6	8	21600


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 121 #######################


> Neighbours evaluated; 21
> Selected Move:	2435	3	5	7	21700


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 122 #######################


> Neighbours evaluated; 17
> Selected Move:	2406	3	7	6	21700


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 123 #######################


> Neighbours evaluated; 22
> Selected Move:	2340	3	3	5	21200


> New Y[]: 
	
	 2  0  4  0  1  1  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 124 #######################


> Neighbours evaluated; 23
> Selected Move:	2354	3	4	7	21200


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 125 #######################


> Neighbours evaluated; 24
> Selected Move:	2340	2	9	-1	17200


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 126 #######################


> Neighbours evaluated; 27
> Selected Move:	2340	4	6	5	18100


> New Y[]: 
	
	 2  0  4  0  0  3  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 127 #######################


> Neighbours evaluated; 27
> Selected Move:	2390	3	6	4	16600


> New Y[]: 
	
	 2  0  4  0  1  3  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 128 #######################


> Neighbours evaluated; 22
> Selected Move:	2390	4	5	8	16500


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 129 #######################


> Neighbours evaluated; 24
> Selected Move:	2350	3	7	3	17500


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,16

## ITERATION 130 #######################


> Neighbours evaluated; 24
> Selected Move:	2350	4	8	3	17300


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,155

## ITERATION 131 #######################


> Neighbours evaluated; 24
> Selected Move:	2350	4	3	4	18000


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 132 #######################


> Neighbours evaluated; 24
> Selected Move:	2350	4	4	5	17600


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 133 #######################


> Neighbours evaluated; 23
> Selected Move:	2350	3	5	1	16000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 134 #######################


> Neighbours evaluated; 31
> Selected Move:	2320	1	-1	7	20500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 135 #######################


> Neighbours evaluated; 28
> Selected Move:	2390	3	3	5	20000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 136 #######################


> Neighbours evaluated; 29
> Selected Move:	2331	3	1	9	22300


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 137 #######################


> Neighbours evaluated; 23
> Selected Move:	2353	3	8	6	22300


> New Y[]: 
	
	 2  0  4  0  1  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 138 #######################


> Neighbours evaluated; 22
> Selected Move:	2334	3	6	3	21800


> New Y[]: 
	
	 2  0  4  1  1  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 139 #######################


> Neighbours evaluated; 23
> Selected Move:	2332	3	9	6	21200


> New Y[]: 
	
	 2  0  4  1  1  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 140 #######################


> Neighbours evaluated; 24
> Selected Move:	2346	3	3	8	21700


> New Y[]: 
	
	 2  0  4  0  1  1  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 141 #######################


> Neighbours evaluated; 22
> Selected Move:	2320	2	7	-1	17200


> New Y[]: 
	
	 2  0  4  0  1  1  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 142 #######################


> Neighbours evaluated; 23
> Selected Move:	2320	4	6	4	18500


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 143 #######################


> Neighbours evaluated; 23
> Selected Move:	2340	3	4	7	18700


> New Y[]: 
	
	 2  0  4  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 144 #######################


> Neighbours evaluated; 23
> Selected Move:	2340	4	7	8	18000


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 145 #######################


> Neighbours evaluated; 26
> Selected Move:	2340	3	8	1	15500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 146 #######################


> Neighbours evaluated; 32
> Selected Move:	2300	3	7	9	15000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 147 #######################


> Neighbours evaluated; 31
> Selected Move:	2280	3	5	4	14500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 148 #######################


> Neighbours evaluated; 30
> Selected Move:	2330	3	6	7	13000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 149 #######################


> Neighbours evaluated; 29
> Selected Move:	2280	3	9	3	14500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 150 #######################


> Neighbours evaluated; 28
> Selected Move:	2280	3	3	5	14000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 151 #######################


> Neighbours evaluated; 29
> Selected Move:	2280	3	7	8	15500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 152 #######################


> Neighbours evaluated; 31
> Selected Move:	2260	1	-1	6	21500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 153 #######################


> Neighbours evaluated; 28
> Selected Move:	2320	4	1	5	18100


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 154 #######################


> Neighbours evaluated; 22
> Selected Move:	2320	4	5	8	18000


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 155 #######################


> Neighbours evaluated; 23
> Selected Move:	2288	1	-1	7	22500


> New Y[]: 
	
	 2  0  4  0  1  1  1  1  3  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 156 #######################


> Neighbours evaluated; 23
> Selected Move:	2310	3	4	9	22000


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 157 #######################


> Neighbours evaluated; 23
> Selected Move:	2311	4	8	5	22100


> New Y[]: 
	
	 2  0  4  0  0  3  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 158 #######################


> Neighbours evaluated; 23
> Selected Move:	2316	3	9	4	22600


> New Y[]: 
	
	 2  0  4  0  1  3  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 159 #######################


> Neighbours evaluated; 21
> Selected Move:	2291	3	7	9	22100


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 160 #######################


> Neighbours evaluated; 21
> Selected Move:	2380	3	5	3	22300


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 161 #######################


> Neighbours evaluated; 21
> Selected Move:	2348	4	3	8	22500


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 162 #######################


> Neighbours evaluated; 21
> Selected Move:	2280	4	8	4	23000


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 163 #######################


> Neighbours evaluated; 22
> Selected Move:	2370	3	8	5	22000


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 164 #######################


> Neighbours evaluated; 19
> Selected Move:	2350	3	6	8	22000


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 165 #######################


> Neighbours evaluated; 18
> Selected Move:	2330	2	8	-1	16000


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 166 #######################


> Neighbours evaluated; 22
> Selected Move:	2340	3	4	7	16200


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 167 #######################


> Neighbours evaluated; 21
> Selected Move:	2340	4	7	5	15600


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 168 #######################


> Neighbours evaluated; 22
> Selected Move:	2330	3	7	4	15600


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 169 #######################


> Neighbours evaluated; 18
> Selected Move:	2330	4	5	3	15300


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 170 #######################


> Neighbours evaluated; 18
> Selected Move:	2330	4	3	9	17300


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 171 #######################


> Neighbours evaluated; 21
> Selected Move:	2260	2	5	-1	12300


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  0  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 172 #######################


> Neighbours evaluated; 23
> Selected Move:	2360	3	9	6	11700


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 173 #######################


> Neighbours evaluated; 19
> Selected Move:	2360	4	6	3	12300


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 174 #######################


> Neighbours evaluated; 20
> Selected Move:	2360	4	3	4	13000


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 175 #######################


> Neighbours evaluated; 25
> Selected Move:	2280	3	6	8	13000


> New Y[]: 
	
	 2  0  4  1  3  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 176 #######################


> Neighbours evaluated; 22
> Selected Move:	2280	4	4	3	12300


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 177 #######################


> Neighbours evaluated; 21
> Selected Move:	2280	4	3	8	12500


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,11

## ITERATION 178 #######################


> Neighbours evaluated; 22
> Selected Move:	2190	3	8	7	11700


> New Y[]: 
	
	 2  0  4  1  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,105

## ITERATION 179 #######################


> Neighbours evaluated; 20
> Selected Move:	2340	3	4	9	11200


> New Y[]: 
	
	 2  0  4  1  0  0  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0999999999999996

## ITERATION 180 #######################


> Neighbours evaluated; 18
> Selected Move:	2340	4	7	3	10300


> New Y[]: 
	
	 2  0  4  3  0  0  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0949999999999996

## ITERATION 181 #######################


> Neighbours evaluated; 18
> Selected Move:	2340	4	3	9	12300


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 182 #######################


> Neighbours evaluated; 23
> Selected Move:	2260	3	9	6	11700


> New Y[]: 
	
	 2  0  4  1  0  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 183 #######################


> Neighbours evaluated; 22
> Selected Move:	2260	4	6	3	12300


> New Y[]: 
	
	 2  0  4  3  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 184 #######################


> Neighbours evaluated; 21
> Selected Move:	2260	4	3	7	13200


> New Y[]: 
	
	 2  0  4  1  0  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 185 #######################


> Neighbours evaluated; 22
> Selected Move:	2260	3	3	5	12700


> New Y[]: 
	
	 2  0  4  0  0  1  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 186 #######################


> Neighbours evaluated; 22
> Selected Move:	2260	4	7	5	12100


> New Y[]: 
	
	 2  0  4  0  0  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 187 #######################


> Neighbours evaluated; 21
> Selected Move:	2260	4	5	6	11200


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 188 #######################


> Neighbours evaluated; 24
> Selected Move:	2260	1	-1	3	16700


> New Y[]: 
	
	 2  0  4  1  0  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 189 #######################


> Neighbours evaluated; 21
> Selected Move:	2392	1	-1	9	20700


> New Y[]: 
	
	 2  0  4  1  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0499999999999996

## ITERATION 190 #######################


> Neighbours evaluated; 22
> Selected Move:	2425	3	5	8	21700


> New Y[]: 
	
	 2  0  4  1  0  0  3  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0449999999999996

## ITERATION 191 #######################


> Neighbours evaluated; 24
> Selected Move:	2451	3	9	4	22200


> New Y[]: 
	
	 2  0  4  1  1  0  3  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0399999999999996

## ITERATION 192 #######################


> Neighbours evaluated; 23
> Selected Move:	2518	3	6	9	22800


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0349999999999996

## ITERATION 193 #######################


> Neighbours evaluated; 22
> Selected Move:	2542	3	8	6	22800


> New Y[]: 
	
	 2  0  4  1  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0399999999999996

## ITERATION 194 #######################


> Neighbours evaluated; 23
> Selected Move:	2468	3	7	5	23300


> New Y[]: 
	
	 2  0  4  1  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0449999999999996

## ITERATION 195 #######################


> Neighbours evaluated; 23
> Selected Move:	2442	3	6	8	23300


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0499999999999996

## ITERATION 196 #######################


> Neighbours evaluated; 23
> Selected Move:	2395	3	5	6	24300


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  0 
 > pw :0,0549999999999996

## ITERATION 197 #######################


> Neighbours evaluated; 24
> Selected Move:	2400	3	9	1	22000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0599999999999996

## ITERATION 198 #######################


> Neighbours evaluated; 28
> Selected Move:	2328	3	1	7	23700


> New Y[]: 
	
	 2  0  4  1  1  0  1  3  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0649999999999996

## ITERATION 199 #######################


> Neighbours evaluated; 23
> Selected Move:	2368	4	7	3	22800


> New Y[]: 
	
	 2  0  4  3  1  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0699999999999996

## ITERATION 200 #######################


> Neighbours evaluated; 21
> Selected Move:	2349	3	4	9	22300


> New Y[]: 
	
	 2  0  4  3  0  0  1  1  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0749999999999996

## ITERATION 201 #######################


> Neighbours evaluated; 22
> Selected Move:	2333	3	8	5	21300


> New Y[]: 
	
	 2  0  4  3  0  1  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 202 #######################


> Neighbours evaluated; 21
> Selected Move:	2326	3	9	4	21800


> New Y[]: 
	
	 2  0  4  3  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 203 #######################


> Neighbours evaluated; 21
> Selected Move:	2292	4	3	5	22100


> New Y[]: 
	
	 2  0  4  1  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0 
 > pw :0,0899999999999996
________________________________________________________________

Best solution found: 2680
Run Termination time: 31.01.2010 10:16:14
Run duration: 00:00:29.7500000
________________________________________________________________
